Transformations, Implementations, and Pitfalls
نویسندگان
چکیده
منابع مشابه
Theories, Implementations, and Transformations
The purpose of this paper is to try to put theory presentation and structuring in the simplest possible logical setting in order to improve our understanding of it. We look at how theories can be combined, and compared for strength. We look at theory refinement and implementation, and what constitutes proof of correctness. Our examples come from both the functional style and imperative (state-c...
متن کاملProving Equivalence Between Imperative and MapReduce Implementations Using Program Transformations
Distributed programs are often formulated in popular functional frameworks like MapReduce, Spark and Thrill, but writing efficient algorithms for such frameworks is usually a non-trivial task. As the costs of running faulty algorithms at scale can be severe, it is highly desirable to verify their correctness. We propose to employ existing imperative reference implementations as specifications f...
متن کاملGenerating Refactoring Implementations from Platform Independent Metamodel Transformations
Increasingly more developers are applying refactorings program transformations that can improve the design of existing source code to make their software more easily adaptable to new requirements. Because small changes to object-oriented software (such as renaming a class) can require a lot of updates to several source files, tools that automatically update the affected files can save these dev...
متن کاملPitfalls of AspectJ Implementations of Some of the Gang-of-Four Design Patterns
For the previous edition of this workshop [8], the authors wrote a paper presenting the aims of the first author’s Ph.D. project [13], which includes the development of a catalogue of refactorings [3] for the AspectJ programming language [1]. Case studies are be used for refactoring experiments, to gain the necessary insights. In this paper, we present several considerations on some code exampl...
متن کاملEntropy of infinite systems and transformations
The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2011
ISSN: 1617-7061
DOI: 10.1002/pamm.201110419